## Uses of Class
oracle.pgx.api.VertexSequence

- Packages that use VertexSequence
  Package | Description
  --- | ---
  oracle.pgx.api | This package contains the Java APIs of PGX.

- - ### Uses of VertexSequence in oracle.pgx.api

    Methods in oracle.pgx.api that return VertexSequence
    Modifier and Type | Method and Description
    --- | ---
    `<E extends Comparable<E>> VertexSequence<E>` | PgxGraph.`createVertexSequence()` Blocking version of `PgxGraph.createVertexSequenceAsync()`.
    `<E extends Comparable<E>> VertexSequence<E>` | PgxGraph.`createVertexSequence(String name)` Blocking version of `PgxGraph.createVertexSequenceAsync()`.

    Methods in oracle.pgx.api that return types with arguments of type VertexSequence
    Modifier and Type | Method and Description
    --- | ---
    `<E extends Comparable<E>> PgxFuture<VertexSequence<E>>` | PgxGraph.`createVertexSequenceAsync()` Creates a new Vertex Sequence.
    `<E extends Comparable<E>> PgxFuture<VertexSequence<E>>` | PgxGraph.`createVertexSequenceAsync(String name)` Creates a new Vertex Sequence.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`salsa(BipartiteGraph graph, int k)` Blocking version of `Analyst.salsaAsync(BipartiteGraph, int)`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`salsa(BipartiteGraph graph, int k)` Blocking version of `Analyst.salsaAsync(BipartiteGraph, int)`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`salsa(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)` Blocking version of `Analyst.salsaAsync(BipartiteGraph, int, double, double, int)`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`salsa(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)` Blocking version of `Analyst.salsaAsync(BipartiteGraph, int, double, double, int)`.
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`salsaAsync(BipartiteGraph graph, int k)` Convenience method around `Analyst.salsaAsync(BipartiteGraph, int, double, double, int)` using maxDiff = 0.01 d = 0.85 maxIter = 1000
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`salsaAsync(BipartiteGraph graph, int k)` Convenience method around `Analyst.salsaAsync(BipartiteGraph, int, double, double, int)` using maxDiff = 0.01 d = 0.85 maxIter = 1000
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`salsaAsync(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)` SALSA recommendation algorithm.
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`salsaAsync(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)` SALSA recommendation algorithm.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, ID vertexId, int max)` Convenience wrapper around `Analyst.whomToFollow(PgxGraph, PgxVertex, int)` taking a vertex ID instead of a `PgxVertex`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, ID vertexId, int max)` Convenience wrapper around `Analyst.whomToFollow(PgxGraph, PgxVertex, int)` taking a vertex ID instead of a `PgxVertex`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, ID vertexId, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` Convenience wrapper around `Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, double, double, int, double)` taking a vertex ID instead of a `PgxVertex`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, ID vertexId, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` Convenience wrapper around `Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, double, double, int, double)` taking a vertex ID instead of a `PgxVertex`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int)`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int)`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double)`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double)`.
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max)` Convenience method around `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double)` using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max)` Convenience method around `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double)` using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` The Who to Follow recommendation algorithm by Twitter, Inc.
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` The Who to Follow recommendation algorithm by Twitter, Inc.

Copyright © 2015. All rights reserved.